On n-tardy sets
نویسندگان
چکیده
Harrington and Soare introduced the notion of an n-tardy set. They showed that there is a nonempty E property Q(A) such that if Q(A) then A is 2tardy. Since they also showed no 2-tardy set is complete, Harrington and Soare showed that there exists an orbit of computably enumerable sets such that every set in that orbit is incomplete. Our study of n-tardy sets takes off from where Harrington and Soare left off. We answer all the open questions asked by Harrington and Soare about n-tardy sets. We show there is a 3tardy set A that is not computed by any 2-tardy set B. We also show that there are nonempty E properties Qn(A) such that if Qn(A) then A is properly n-tardy.
منابع مشابه
Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date
This paper considers a scheduling problem for parallel burn-in ovens in the semiconductor manufacturing industry. An oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolute de...
متن کاملDynamic Properties of Computably Enumerable
A set A ! is computably enumerable (c.e.), also called recursively enumerable, (r.e.), or simply enumerable, if there is a computable algorithm to list its members. Let E denote the structure of the c.e. sets under inclusion. Starting with Post 1944] there has been much interest in relating the deenable (especially E-deenable) properties of a c.e. set A to its information contentt, namely its T...
متن کاملA Survey of Single Machine Scheduling to Minimize Weighted Number of Tardy Jobs
This paper presents a review of single machine scheduling to minimize the weighted number of tardy jobs. The problem involves processing n jobs on a single machine, each having processing time pj and due date dj . The aim is to schedule the jobs to meet their due date. A job is tardy if the completion time of job j is Cj > dj and on-time otherwise. This paper assesses works done to minimize the...
متن کاملA faster algorithm for a due date assignment problem with tardy jobs
Keywords: Single-machine sequencing Weighted number of tardy jobs Due date assignment a b s t r a c t The single-machine due date assignment problem with the weighted number of tardy jobs objective, (the TWNTD problem), and its generalization with resource allocation decisions and controllable job processing times have been solved in O(n 4) time by formulating and solving a series of assignment...
متن کاملOn the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
We consider the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 163 شماره
صفحات -
تاریخ انتشار 2012